منابع مشابه
Tarskian Set Constraints
We investigate set constraints over set expressions with Tarskian functional and relational operations. Unlike the Herbrand constructor symbols used in recent set constraint formalisms, the meaning of a Tarskian function symbol is interpreted in an arbitrary first order structure. We show that satisfiability of Tarskian set constraints is decidable in nondeterministic doubly exponential time. W...
متن کاملTarskian Set Constraints Are in NEXPTIME
In this paper we show that satissability of Tarskian set constraints (without recursion) can be decided in exponential time. This closes the gap left open by
متن کاملA Tarskian Semantics for Answer Set Programming
Extended logic programming was introduced initially as an epistemic logic for default and autoepistemic reasoning. With time the reasons for interest in the language have shifted. In 1999 extended logic programming was proposed as the basis of the answer-set programming (ASP) paradigm for modeling and solving search problems and in that role the language is primarily used now. However, in the n...
متن کاملA Tarskian Informal Semantics for Answer Set Programming
In their seminal papers on stable model semantics, Gelfond and Lifschitz introduced ASP by casting programs as epistemic theories, in which rules represent statements about the knowledge of a rational agent. To the best of our knowledge, theirs is still the only published systematic account of the intuitive meaning of rules and programs under the stable semantics. In current ASP practice, howev...
متن کاملNarrowing the Gap between Set-Constraints and CLP(SET)-Constraints
We compare two (apparently) rather different set-based constraint languages, and we show that, in spite of their different origins and aims, there are large classes of constraint formulae for which both proposals provide suitable procedures for testing constraint satisfiability with respect to a given privileged interpretation. Specifically, we present a technique for reducing any set-constrain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2002
ISSN: 0890-5401
DOI: 10.1006/inco.2001.2973